Monotonic Target Assignment for Robotic Networks
نویسندگان
چکیده
منابع مشابه
A Geometric Assignment Problem for Robotic Networks
In this chapter we look at a geometric target assignment problem consisting of an equal number of mobile robotic agents and distinct target locations. Each agent has a fixed communication range, a maximum speed, and knowledge of every target’s position. The problem is to devise a distributed algorithm that allows the agents to divide the target locations among themselves and, simultaneously, le...
متن کاملMonotonic Networks
Monotonicity is a constraint which arises in many application domains. We present a machine learning model, the monotonic network, for which monotonicity can be enforced exactly, i.e., by virtue offunctional form . A straightforward method for implementing and training a monotonic network is described. Monotonic networks are proven to be universal approximators of continuous, differentiable mon...
متن کاملGradient-based target localization in robotic sensor networks
Fast target localization without a map is a challenging problem in search and rescue applications. We propose and evaluate a novel gradient-based method which uses statistical techniques to estimate the position of a stationary target. Mobile nodes can then be directed toward the target using the shortest path. Moreover, localization can be achieved without any assistance from stationary sensor...
متن کاملNon-monotonic Hopfield Networks
We investigate the retrieval phase diagrams of an asynchronous fully-connected attractor network with non-monotonic transfer function by means of a mean-field approximation. We find for the noiseless zero-temperature case that this non-monotonic Hopfield network can store more patterns than a network with monotonic transfer function investigated by Amit et al. Properties of retrieval phase diag...
متن کاملAerial Monotonic based Layer Assignment on 3D Global Routing
The complexity and routability of layout depends on the number of layers, which can be used for the completion of interconnections. The global routing can be solved by graph based techniques. Efficient 3D routing methods are efficient to minimize the via overflows and total number of vias. The minimization methods rip-up and reassignment for a integer programming based layer assignment. Benchma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2009
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2009.2026926